n-Shrinking Neighborhoods
نویسنده
چکیده
In this paper we give a motivation for the shrinking rate 1/ √ n: Let p0 and qn be the outlier probability under the ideal model, and some member of a neighborhood about this ideal model of radius rn, respectively. Assuming n i.i.d. observations, the critical rate of rn may be de ned such that the minimax test for outlier probability qn = p0 vs. qn > p0 has asymptotic error probabilities bounded away from 0 and 1/2. Summarizing the neighborhoods to their upper probability, this leads to rn of the exact rate 1/ √ n. The result makes precise and simpli es ideas in Bickel (1981), Rieder (1994), and Huber (1997). Considering general probabilities of exact Hellinger distance rn to P, this shrinking rate translates into 1/ 4 √ n, but leads to the same optimality theory as in the corresponding 1/ √ n setup. Mathematics Subject Classi cation (1991): 62F35
منابع مشابه
Higher order asymptotics for the MSE of the median on shrinking neighborhoods
Infinitesimal robustness employs first order asymptotics to derive results on uniform (weak) convergence on shrinking neighborhoods around an ideal central model. In the case of the median in the one–dimensional location setup, we refine such a result concerning the convergence of the MSE, proceeding to higher order asymptotics — up to order 1/n , for sample size n . In contrast to usual higher...
متن کاملHigher order asymptotics for the MSE of M-estimators on shrinking neighborhoods
In the setup of shrinking neighborhoods about an ideal central model, Rieder (1994) determines the as. linear estimator minimaxing MSE on these neighborhoods. We address the question to which degree this as. optimality carries over to finite sample size. We consider estimation of a one-dim. location parameter by means of M-estimators Sn with monotone influence curve ψ . Using Donoho and Huber (...
متن کاملShrinking games and local formulas
Gaifman’s normal form theorem showed that every first order sentence of quantifier rank n is equivalent to a Boolean combination of “scattered local sentences”, where the local neighborhoods have radius at most 7n−1. This bound was improved by Lifsches and Shelah to 3 · 4n−1. We use Ehrenfeucht-Fräıssé type games with a “shrinking horizon” to get a spectrum of normal form theorems of the Gaifma...
متن کاملNonparametric Estimation Over Shrinking Neighborhoods: Superefficiency and Adaptation
A theory of superefficiency and adaptation is developed under flexible performance measures which give a multiresolution view of risk and bridge the gap between pointwise and global estimation. This theory provides a useful benchmark for the evaluation of spatially adaptive estimators and shows that the possible degree of superefficiency for minimax rate optimal estimators critically depends on...
متن کاملNonparametric Estimation over Shrinking Neighborhoods: Superefficiency and Adaptation1 by T. Tony Cai
A theory of superefficiency and adaptation is developed under flexible performance measures which give a multiresolution view of risk and bridge the gap between pointwise and global estimation. This theory provides a useful benchmark for the evaluation of spatially adaptive estimators and shows that the possible degree of superefficiency for minimax rate optimal estimators critically depends on...
متن کامل